A Method for Fast Computation of the Fourier Transform over a Finite Field
نویسندگان
چکیده
—We consider the problem of fast computation of the Fourier transform over a finite field by decomposing an arbitrary polynomial into a sum of linearized polynomials. Examples of algorithms for the Fourier transform with complexity less than that of the best known analogs are given.
منابع مشابه
The (finite field) Fast Fourier Transform
There are numerous directions from which one can approach the subject of the fast Fourier Transform (FFT). It can be explained via numerous connections to convolution, signal processing, and various other properties and applications of the algorithm. We (along with Geddes/Czapor/Labahn) take a rather simple view from the algebraic manipulation standpoint. As will be apparent shortly, we relate ...
متن کاملThe (finite field) Fast Fourier Transform
There are numerous directions from which one can approach the subject of the fast Fourier Transform (FFT). It can be explained via numerous connections to convolution, signal processing, and various other properties and applications of the algorithm. We (along with Geddes/Czapor/Labahn) take a rather simple view from the algebraic manipulation standpoint. As will be apparent shortly, we relate ...
متن کاملFast Finite Element Method Using Multi-Step Mesh Process
This paper introduces a new method for accelerating current sluggish FEM and improving memory demand in FEM problems with high node resolution or bulky structures. Like most of the numerical methods, FEM results to a matrix equation which normally has huge dimension. Breaking the main matrix equation into several smaller size matrices, the solving procedure can be accelerated. For implementing ...
متن کاملNumerical methods for the stray-field calculation: A comparison of recently developed algorithms
Different numerical approaches for the stray-field calculation in the context of micromagnetic simulations are investigated. We compare finite difference based fast Fourier transform methods, tensor-grid methods and the finite-element method with shell transformation in terms of computational complexity, storage requirements and accuracy tested on several benchmark problems. These methods can b...
متن کاملComputational Complexity of Fourier Transforms Over Finite Fields*
In this paper we describe a method for computing the Discrete Fourier Transform (DFT) of a sequence of n elements over a finite field GF(pm) with a number of bit operations 0(nm log(nm) ■ P(q)) where P(q) is the number of bit operations required to multiply two q-bit integers and q = 2 log2« + 4 log2m + 4 log2p. This method is uniformly applicable to all instances and its order of complexity is...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید
ثبت ناماگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید
ورودعنوان ژورنال:
- Probl. Inf. Transm.
دوره 39 شماره
صفحات -
تاریخ انتشار 2003